Mpp Parallel Haskell Preliminary Results
نویسنده
چکیده
Preliminary Results Kei Davis http://www.c3.lanl.gov/~kei/kei.html Abstract MPP Haskell is a parallel implementation of the lazy purely-functional language Haskell for the Thinking Machines Inc. CM-5 large-scale distributed-memory multiprocessor. MPP Haskell is a derivative of GUM, a message-based parallel implementation of Haskell. GUM was carefully designed to minimise performance loss from low-bandwidth and high-latency communications. As an apparent consequence MPP Haskell, with the bene t of high-bandwidth and lowlatency communications, achieves remarkably scalable performance; it appears to be the highest performance higher-order lazy functional language implementation extant. Despite existing ine ciencies in lazy language implementation, considerable performance is recouped by automatic dynamic load balancing.
منابع مشابه
Parallel Haskell ( Preliminary Draft )
MPP Haskell is a parallel implementation of the Haskell functional language for the Thinking Machines Inc. CM-5 large-scale distributed-memory multiprocessor. MPP Haskell is a derivative of GUM, a message-based parallel implementation of Haskell. GUM was carefully designed to minimise performance loss from low-bandwidth and high-latency communications; as an apparent consequence MPP Haskell, wi...
متن کاملImplementing a High-Level Distributed-Memory Parallel Haskell in Haskell
We present the initial design, implementation and preliminary evaluation of a new distributed memory parallel Haskell, HdpH. The language is a shallowly embedded parallel extension of Haskell that supports high-level semiexplicit parallelism, is scalable, and has the potential for fault tolerance. The HdpH implementation is designed for maintainability without compromising performance too sever...
متن کاملParallel heuristic search in Haskell
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming languag...
متن کاملGPU Kernels as Data-Parallel Array Computations in Haskell
We present a novel high-level parallel programming model aimed at graphics processing units (GPUs). We embed GPU kernels as data-parallel array computations in the purely functional language Haskell. GPU and CPU computations can be freely interleaved with the type system tracking the two different modes of computation. The embedded language of array computations is sufficiently limited that our...
متن کاملComputing Data Cubes Using Massively Parallel Processors
To better support decision making, it was proposed to extend SQL to include data cube operations. Computation of data cube requires computing a number of interrelated group-bys, which is rather expensive operation when databases are large. In this paper, we propose to couple a relational database management system with massively parallel processors (MPP) to facilitate on-line analytic processin...
متن کامل